Distributed Greedy Algorithm for Satellite Assignment Problem with Submodular Utility Function
نویسنده
چکیده
Recent advances in spacecraft technology allow a large number of smaller and cheaper satellites to fulfill useful Earth monitoring roles. An emerging challenge is to coordinate those satellites to monitor the Earth’s surface and atmosphere. In this paper, we study the satellite assignment problem for a large constellation of Earth observing satellites, where a set of satellites assign themselves to observe a set of locations. The objective is to maximize a global utility function that is associated with the assignment profile. Due to the communication constraints of the space system, we develop a distributed assignment algorithm where each satellite makes its choice based on local information and local communication. We show that the efficiency ratio of the distributed solution to the optimal one is lower bounded by 1/2. Moreover, this bound is proven to be tight in the sense that there exist scenarios where the bound 1/2 is approached as close as possible.
منابع مشابه
Revisiting the Greedy Approach to Submodular Set Function Maximization
We consider the problem of maximizing a nondecreasing submodular set function over various constraint structures. Specifically, we explore the performance of the greedy algorithm, and a related variant, the locally greedy algorithm in solving submodular function maximization problems. Most classic results on the greedy algorithm and its variant assume the existence of an optimal polynomial-time...
متن کاملDistributed Submodular Cover: Succinctly Summarizing Massive Data
How can one find a subset, ideally as small as possible, that well represents a massive dataset? I.e., its corresponding utility, measured according to a suitable utility function, should be comparable to that of the whole dataset. In this paper, we formalize this challenge as a submodular cover problem. Here, the utility is assumed to exhibit submodularity, a natural diminishing returns condit...
متن کاملMaximizing a Monotone Submodular Function Subject to a Matroid Constraint
Let f : 2 → R+ be a monotone submodular set function, and let (X, I) be a matroid. We consider the problem maxS∈I f(S). It is known that the greedy algorithm yields a 1/2approximation [14] for this problem. For certain special cases, e.g. max|S|≤k f(S), the greedy algorithm yields a (1− 1/e)-approximation. It is known that this is optimal both in the value oracle model (where the only access to...
متن کاملForthcoming in Mathematical Programming MAXIMIZING A CLASS OF SUBMODULAR UTILITY FUNCTIONS
Given a finite ground set N and a value vector a ∈ R , we consider optimization problems involving maximization of a submodular set utility function of the form h(S) = f (∑ i∈S ai ) , S ⊆ N , where f is a strictly concave, increasing, differentiable function. This function appears frequently in combinatorial optimization problems when modeling risk aversion and decreasing marginal preferences, ...
متن کاملDeveloping a New Algorithm for a Utility-based Network Design Problem with Elastic Demand
Developing the infrastructures for preventing non-communicable diseases is one of the most important goals of healthcare context in recent years. In this regard, the number and capacity of preventive healthcare facilities as well as assignment of customers to facilities should be determined for each region. Besides the accessibility, the utility of customers is a determinative factor in partici...
متن کامل